#include <iostream>
#include <fstream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <deque>
#include <ctime>
#include <cstdlib>

using namespace std;

#define sz(x) ((int)((x).size()))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

const double EPS = 1e-9;
const double PI = acos(-1.0);

int n;
int mt[2050];
int osn[2050];
vector<int> b[2050], g[2050];
vector<int> ans[2050];
int used[2050], UU;
bool uu[2050];
int V, ID;

bool go(int v) {
	if (used[v] == UU)
		return false;
	used[v] = UU;
	if (v != V) {
		for (int i = 0; i < sz(b[v]); i++) {
			if ((mt[b[v][i]] == -1 || go(mt[b[v][i]]))) {
				uu[v] = true;
				mt[b[v][i]] = v;
				return true;
			}
		}
	} else {
		if (mt[b[v][ID]] == -1 || go(mt[b[v][ID]])) {
			uu[v] = true;
			mt[b[v][ID]] = v;
			return true;
		}
	}
	return false;
}

int main() {
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);

	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int k;
		scanf("%d", &k);
		while (k-- > 0) {
			int to;
			scanf("%d", &to);
			--to;
			b[i].push_back(to);
			g[to].push_back(i);
		}
	}
	for (int i = 0; i < n; i++) {
		int x;
		scanf("%d", &x);
		--x;
		osn[x] = i;
	}
	UU = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < sz(b[i]); j++) {
			for (int k = 0; k < n; k++) {
				uu[k] = false;
			}
			for (int k = 0; k < n; k++) {
				if (osn[k] != i && k != b[i][j]) {
					mt[k] = osn[k];
					uu[osn[k]] = true;
				} else {
					mt[k] = -1;
				}
			}
			V = i;
			ID = j;
			for (int k = 0; k < n; k++) {
				if (!uu[k]) {
					UU++;
					go(k);
				}
			}
			bool ok = true;
			if (mt[b[i][j]] != i)
				ok = false;
			for (int k = 0; k < n; k++) {
				if (mt[k] == -1) {
					ok = false;
					break;
				}
			}
			if (ok)
				ans[i].push_back(b[i][j]);
		}
		printf("%d", sz(ans[i]));
		for (int j = 0; j < sz(ans[i]); j++) {
			printf(" %d", ans[i][j] + 1);
		}
		puts("");
	}

	return 0;
}
